A comment on the e ciency of secret sharingscheme over any nite Abelian group ?

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

Looking Out for The Secret Wound: The Effect of E-Cognitive Group Therapy with Emotional Disclosure on The Status of Mental Health in Infertile Women

Lower Bounds for non-Boolean Constraint Satisfa tion Programs

Constraint Satisfa tion Programs Lars Engebretsen Dept. of Numeri al Analysis and Computer S ien e Royal Institute of Te hnology SE-100 44 Sto kholm, SWEDEN E-mail: enge nada.kth.se Abstra t. We show that the k-CSP problem over a nite Abelian group G annot be approximated within jGjk O(pk) , for any onstant > 0, unless P = NP. This lower bound mat hes well with the best known upper bound, jGjk ...

On the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian

In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.

Computing automorphisms of finite soluble groups

There is a large collection of e ective algorithms for computing information about nite soluble groups. The success in computation with these groups is primarily due to a computationally convenient representation of them by means of (special forms of) power conjugate presentations. A notable omission from this collection of algorithms is an e ective algorithm for computing the automorphism grou...